Ternary codes of minimum weight 6 and the classification of the self-dual codes of length 20
نویسندگان
چکیده
Abstmct-Self-orthogonal ternary codes of minimum weight 3 may be analyzed in a straightforward mamer using the theory of glueing introduced in earlier papers. The present paper describes a method far studying codes of minimum weight 6: the supporta of the words of weight 6 form what is c&xl a center set. Associated with each center set is a graph, and~tbegraphsthatcan~seinthiswayareknown.’Ibesetechniques areusedtoclasslfytheternaryselldualeodesofLengthu):tbereare24 inequivalent codes, 17 of which are hlecomposable. Sk of the codea have mini~~u~~ weight 6.
منابع مشابه
On ternary self-dual codes of length 24
A hstract-A partial classification is given of the self-dual codes of length 24 over GF(3). The main results are as follows: there are exactly two codes with minimum Hamming distance d = 9; most of the codes have d = 6 and are indecomposable; one code with d = 6 has a trivial automor-phism group (this is the first such self-dual code that has been found); the codes generated by the 59 inequival...
متن کاملOptimal ternary formally self-dual codes
In this paper, we study ternary optimal formally self-dual codes. Bounds for the highest minimum weight are given for length up to 30 and examples of optimal formally self-dual codes are constructed. For some lengths, we have found formally self-dual codes which have a higher minimum weight than any self-dual code. It is also shown that any optimal formally self-dual [ 10,5,5] code is related t...
متن کامل2 00 8 A Complete Classification of Ternary Self - Dual Codes of Length 24 Masaaki Harada
Ternary self-dual codes have been classified for lengths up to 20. At length 24, a classification of only extremal self-dual codes is known. In this paper, we give a complete classification of ternary self-dual codes of length 24 using the classification of 24-dimensional odd unimodular lattices.
متن کاملOn extremal self-dual ternary codes of length 48
The notion of an extremal self-dual code has been introduced in 1 . As Gleason 2 remarks onemay use invariance properties of the weight enumerator of a self-dual code to deduce upper bounds on the minimum distance. Extremal codes are self-dual codes that achieve these bounds. The most wanted extremal code is a binary self-dual doubly even code of length 72 and minimum distance 16. One frequentl...
متن کاملAn Efficient Construction of Self-Dual Codes
We complete the building-up construction for self-dual codes by resolving the open cases over GF (q) with q ≡ 3 (mod 4), and over Zpm and Galois rings GR(p, r) with an odd prime p satisfying p ≡ 3 (mod 4) with r odd. We also extend the buildingup construction for self-dual codes to finite chain rings. Our building-up construction produces many new interesting self-dual codes. In particular, we ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IEEE Trans. Information Theory
دوره 26 شماره
صفحات -
تاریخ انتشار 1980